WORST_CASE(?,O(n^2))

Solution:
---------

  "a" :: [] -(0)-> "A"(5, 5)
  "a" :: [] -(0)-> "A"(0, 14)
  "a" :: [] -(0)-> "A"(15, 15)
  "a" :: [] -(0)-> "A"(8, 11)
  "a__f" :: ["A"(11, 5)] -(7)-> "A"(6, 5)
  "f" :: ["A"(5, 5)] -(11)-> "A"(11, 5)
  "f" :: ["A"(14, 14)] -(0)-> "A"(0, 14)
  "f" :: ["A"(13, 13)] -(0)-> "A"(0, 13)
  "f" :: ["A"(5, 5)] -(6)-> "A"(6, 5)
  "g" :: ["A"(0, 14)] -(14)-> "A"(0, 14)
  "g" :: ["A"(0, 8)] -(8)-> "A"(15, 8)
  "g" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "mark" :: ["A"(0, 14)] -(8)-> "A"(0, 0)


Cost Free Signatures:
---------------------

  "a" :: [] -(0)-> "A"_cf(1, 1)
  "a" :: [] -(0)-> "A"_cf(8, 8)
  "a" :: [] -(0)-> "A"_cf(0, 0)
  "a__f" :: ["A"_cf(4, 1)] -(0)-> "A"_cf(0, 1)
  "a__f" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "f" :: ["A"_cf(1, 1)] -(4)-> "A"_cf(4, 1)
  "f" :: ["A"_cf(8, 8)] -(0)-> "A"_cf(0, 8)
  "f" :: ["A"_cf(1, 1)] -(0)-> "A"_cf(0, 1)
  "f" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "g" :: ["A"_cf(0, 3)] -(3)-> "A"_cf(6, 3)
  "g" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "g" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(4, 0)
  "mark" :: ["A"_cf(0, 0)] -(2)-> "A"_cf(0, 0)


Base Constructors:
------------------
  "\"a\"_A" :: [] -(0)-> "A"(1, 0)
  "\"a\"_A" :: [] -(0)-> "A"(0, 1)
  "\"f\"_A" :: ["A"(0, 0)] -(1)-> "A"(1, 0)
  "\"f\"_A" :: ["A"(1, 1)] -(0)-> "A"(0, 1)
  "\"g\"_A" :: ["A"(0, 0)] -(0)-> "A"(1, 0)
  "\"g\"_A" :: ["A"(0, 1)] -(1)-> "A"(0, 1)